public class Test41 {
    public int longestCommonSubsequence(String text1, String text2) {
        int m = text1.length();
        int n = text2.length();
        int[][] dp = new int[m + 1][n + 1];
        text1 = " " + text1;
        text2 = " " + text2;
        for(int i = 1;i <= m;i++) {
            for(int j = 1;j <= n;j++) {
                if(text1.charAt(i) == text2.charAt(j)) {
                    dp[i][j] = dp[i - 1][j - 1] + 1;
                }else {
                    dp[i][j] = Math.max(dp[i][j - 1],dp[i - 1][j]);
                }
            }
        }
        return dp[m][n];
    }
}
